Polynomial assignments
نویسندگان
چکیده
The concept of assignments was introduced in [GGK99] as a method for extracting geometric information about group actions on manifolds from combinatorial data encoded in the infinitesimal orbit-type stratification. In this paper we will answer in the affirmative a question posed in [GGK99] by showing that the equivariant cohomology ring of M is to a large extent determined by this data.
منابع مشابه
Linear Satisfiability Preserving Assignments
In this paper, we study several classes of satisfiability preserving assignments to the constraint satisfaction problem (CSP). In particular, we consider fixable, autark and satisfying assignments. Since it is in general NP-hard to find a nontrivial (i.e., nonempty) satisfiability preserving assignment, we introduce linear satisfiability preserving assignments, which are defined by polyhedral c...
متن کاملOn Finding Ranked Assignments With Application to Multi - TargetTracking
Within the target tracking community there is strong interest in computing a ranked set of assignments of measurements to targets. These k-best assignments are then used to determine good approximations to the data association problem. Much earlier work described algorithms which either had exponential worst case time or were not guaranteed to return the k-best assignments. Most recently, Danch...
متن کاملInvariant Generation for P-Solvable Loops with Assignments
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only. The approach combines algorithmic combinatorics, polynomial algebra and computational logic, and it is implemented in a new software package called Aligator. We present a collection of examples illustrating the powe...
متن کاملInverting Onto Functions
We look at the hypothesis that all honest onto polynomial-time computable functions have a polynomial-time computable inverse. We show this hypothesis equivalent to several other complexity conjectures including • In polynomial time, one can find accepting paths of nondeterministic polynomialtime Turing machines that accept Σ∗. • Every total multivalued nondeterministic function has a polynomia...
متن کاملAn approximation trichotomy for Boolean #CSP
We give a trichotomy theorem for the complexity of approximately counting the number of satisfying assignments of a Boolean CSP instance. Such problems are parameterised by a constraint language specifying the relations that may be used in constraints. If every relation in the constraint language is affine then the number of satisfying assignments can be exactly counted in polynomial time. Othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013